Output-sensitive algorithms for computing nearest-neighbour decision boundariesBREMNER, David; DEMAINE, Erik; ERICKSON, Jeff et al.Lecture notes in computer science. 2003, pp 451-461, issn 0302-9743, isbn 3-540-40545-3, 11 p.Conference Paper

Dynamic optimality-almostDEMAINE, Erik D; HARMON, Dion; IACONO, John et al.Annual Symposium on Foundations of Computer Science. 2004, pp 484-490, isbn 0-7695-2228-9, 1Vol, 7 p.Conference Paper

On the hierarchy of distribution-sensitive properties for data structuresELMASRY, Amr; FARZAN, Arash; IACONO, John et al.Acta informatica. 2013, Vol 50, Num 4, pp 289-295, issn 0001-5903, 7 p.Article

Key-independent optimalityIACONO, John.Algorithmica. 2005, Vol 42, Num 1, pp 3-10, issn 0178-4617, 8 p.Conference Paper

Necklaces, Convolutions, and X + YBREMNER, David; CHAN, Timothy M; DEMAINE, Erik D et al.Algorithmica. 2014, Vol 69, Num 2, pp 294-314, issn 0178-4617, 21 p.Article

A unified access bound on comparison-based dynamic dictionariesBADOIU, Mihai; COLE, Richard; DEMAINE, Erik D et al.Theoretical computer science. 2007, Vol 382, Num 2, pp 86-96, issn 0304-3975, 11 p.Conference Paper

Necklaces, convolutions, and X + YBREMNER, David; CHAN, Timothy M; DEMAINE, Erik D et al.Lecture notes in computer science. 2006, pp 160-171, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper